package lc.数组;

/**
 * @description:
 * @author: qian
 * @createDate: 2021/10/14
 */
public class 剑指OfferII069_山峰数组的顶部 {

    public int peakIndexInMountainArray(int[] arr) {

        for (int i = 0; i < arr.length; i++) {
            if (arr[i] < arr[i + 1]) {
                continue;
            }
            return i;
        }
        return 0;
    }
}
